Fast Exponential-Time Algorithms for the Forest Counting and the Tutte Polynomial Computation in Graph Classes
نویسندگان
چکیده
We prove #P-completeness for counting the number of forests in regular graphs and chordal graphs. We also present algorithms for this problem, running in O∗(1.8494m) time for 3-regular graphs, and O∗(1.9706m) time for unit interval graphs, where m is the number of edges in the graph and O∗-notation ignores a polynomial factor. The algorithms can be generalized to the Tutte polynomial computation.
منابع مشابه
Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes
We prove #P-completeness for counting the number of forests in regular graphs and chordal graphs. We also present algorithms for this problem, running in O∗(1.8494m) time for 3-regular graphs, and O∗(1.9706m) time for unit interval graphs, where m is the number of edges in the graph and O∗-notation ignores a polynomial factor. The algorithms can be generalized to the Tutte polynomial computation.
متن کاملTenacity and some other Parameters of Interval Graphs can be computed in polynomial time
In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters of graphs, tenacity and rupture degree are defined. In general, computing the tenacity o...
متن کاملOn the tutte polynomial of benzenoid chains
The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.
متن کاملBlock Interpolation: A Framework for Tight Exponential-Time Counting Complexity
We devise a framework for proving tight lower bounds under the counting exponential-time hypothesis #ETH introduced by Dell et al. (ACM Transactions on Algorithms, 2014). Our framework allows us to convert classical #P-hardness results for counting problems into tight lower bounds under #ETH, thus ruling out algorithms with running time 2o(n) on graphs with n vertices and O(n) edges. As exempla...
متن کاملMaximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width
In this paper, we provide polynomial-time algorithms for different extensions of the matching counting problem, namely maximal matchings, path matchings (linear forest) and paths, on graph classes of bounded clique-width. For maximal matchings, we introduce matchingcover pairs to efficiently handle maximality in the local structure, and develop a polynomial time algorithm. For path matchings, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 20 شماره
صفحات -
تاریخ انتشار 2009